Lambda Coordinates for Binary Elliptic Curves
نویسندگان
چکیده
In this work we present the λ-coordinates, a new system for representing points in binary elliptic curves. We also provide efficient elliptic curve operations based on the new representation and timing results of our software implementation over the field F2254 . As a result, we improve speed records for protected/unprotected single/multi-core software implementations of random-point elliptic curve scalar multiplication at the 128-bit security level. When implemented on a Sandy Bridge 3.4GHz Intel Xeon processor, our software is able to compute a single/multi-core unprotected scalar multiplication in 72,300 and 47,900 clock cycles, respectively; and a protected single-core scalar multiplication in 114,800 cycles. These numbers improve by around 2% on the newer Core i7 2.8GHz Ivy Bridge platform.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملThe family of indefinite binary quadratic forms and elliptic curves over finite fields
In this paper, we consider some properties of the family of indefinite binary quadratic forms and elliptic curves. In the first section, we give some preliminaries from binary quadratic forms and elliptic curves. In the second section, we define a special family of indefinite forms Fi and then we obtain some properties of these forms. In the third section, we consider the number of rational poi...
متن کاملImproving the Parallelized Pollard Lambda Search on Binary Anomalous Curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a set of equivalence classes derived from E, which requires fewer iterations than the standard approach. In the case of binary anomalous curves over F2m , the algorithm speeds up the standard algorithm by a factor of p2m.
متن کاملImproving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a set of equivalence classes derived from E, which requires fewer iterations than the standard approach. In the case of anomalous binary curves over F2m , the new approach speeds up the standard algorithm by a factor of √...
متن کاملA New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields
Now, It is believed that the best costs of a point doubling and addition on elliptic curves over binary fields are S M 5 4 + (namely, four finite field multiplications and five field squarings) and , respectively. In this paper we reduce the costs to less than S M 5 8 + S M 3 3 + and , respectively, by using a new projective coordinates we call PL-coordinates and rewriting the point doubling fo...
متن کامل